Embedding into l ∞ 2 Is Easy, Embedding into l ∞ 3 Is NP-Complete

Embedding into l 2 ∞ is Easy , Embedding into l 3 ∞ is NP - Complete

We give a new algorithm for enumerating all possible embeddings of a metric space (i.e., the distances between every pair within a set of n points) into R Cartesian space preserving their l∞ (or l1) metric distances. Its expected time is O(n 2 log n) (i.e. within a poly-log of the size of the input) beating the previous O(n) algorithm. In contrast, we prove that detecting l ∞ embeddings is NP-c...

Uniform Planar Embedding Is Np - Complete

On the Embedding of 2-concave Orlicz Spaces into L

In [K–S 1] it was shown that Ave π ( n ∑

Embedding normed linear spaces into $C(X)$

‎It is well known that every (real or complex) normed linear space $L$ is isometrically embeddable into $C(X)$ for some compact Hausdorff space $X$‎. ‎Here $X$ is the closed unit ball of $L^*$ (the set of all continuous scalar-valued linear mappings on $L$) endowed with the weak$^*$ topology‎, ‎which is compact by the Banach--Alaoglu theorem‎. ‎We prove that the compact Hausdorff space $X$ can ...

L(2, 1, 1)-Labeling Is NP-Complete for Trees